/*
 *  Copyright 2009 Advanced Industrial Science and Technology (AIST).
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */

/*! \file
 *  \brief
 */

// thrust, includes
#include <thrust/graph/adjacency_list.hpp>
#include <thrust/graph/breadth_first_search.hpp>
#include <thrust/graph/simple_io.hpp>
using namespace thrust;

int
main( int argc, char** argv)
{
  typedef adjacency_list<undirectedS,disallow_parallelS> graph_t;

  unsigned int N =8;

  graph_t g( N);

  add_edge( 7, 1, g);
  add_edge( 1, 4, g);

  std::cout <<g <<std::endl;
  
  bfs_visitor vis;
  breadth_first_search( g, 1, vis);

  return 0;
}
